Degree sequence of random permutation graphs
نویسندگان
چکیده
منابع مشابه
Degree Sequence of Random Permutation Graphs by Bhaswar B. Bhattacharya
In this paper, we study the asymptotics of the degree sequence of permutation graphs associated with a sequence of random permutations. The limiting finite-dimensional distributions of the degree proportions are established using results from graph and permutation limit theories. In particular, we show that for a uniform random permutation, the joint distribution of the degree proportions of th...
متن کاملRandom Hyperbolic Graphs: Degree Sequence and Clustering
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the structural properties that are observed in real world networks (for example, heavy tailed degree distributions, high clustering and small diameter), but it should also be amenable to mathematical analysis. There are plen...
متن کاملRandom graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lovász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. ...
متن کاملRandom Graphs with a Fixed Degree Sequence
Classical Ramsey-theoretic questions on graphs involve coloring the edges of a graph with a fixed number of colors, say k, and determining whether a given monochromatic subgraph exists [13]. Anti-Ramsey questions, on the other hand, consider other restrictions on the colorings (for example, using each color at most b times [17]), and search for subgraphs in which no color is repeated [10]. An e...
متن کاملInduced subgraphs in sparse random graphs with given degree sequence
Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2017
ISSN: 1050-5164
DOI: 10.1214/16-aap1207